Morphological Links Between Formal Concepts and Hypergraphs
نویسنده
چکیده
Hypergraphs can be built from a formal context, and conversely formal contexts can be derived from a hypergraph. Establishing such links allows exploiting morphological operators developed in one framework to derive new operators in the other one. As an example, the combination of derivation operators on formal concepts leads to closing operators on hypergraphs which are not the composition of dilations and erosions. Several other examples are investigated in this paper, with the aim of processing formal contexts and hypergraphs, and navigating in such structures.
منابع مشابه
Formal models of nouns in the Kazakh language
This paper explains how semantic hypergraphs are used to construct ontological models of morphological rules in the Kazakh language. The nodes within these graphs represent semantic features (morphological concepts) and the edges within represent the relationships between these features. Word forms within the hypergraph structure are described in trees which are converted into linear parenthesi...
متن کاملSimilarity between Hypergraphs Based on Mathematical Morphology
In the framework of structural representations for applications in image understanding, we establish links between similarities, hypergraph theory and mathematical morphology. We propose new similarity measures and pseudo-metrics on lattices of hypergraphs based on morphological operators. New forms of these operators on hypergraphs are introduced as well. Some examples based on various dilatio...
متن کاملRobust similarity between hypergraphs based on valuations and mathematical morphology operators
This article aims at connecting concepts of similarity, hypergraph and mathematical morphology. We introduce new measures of similarity and study their relations with pseudometrics defined on lattices. More precisely, based on various lattices that can be defined on hypergraphs, we propose some similarity measures between hypergraphs based on valuations and mathematical morphology operators. We...
متن کاملOn the connection of hypergraph theory with formal concept analysis and rough set theory
We present a unique framework for connecting different topics: hypergraphs from one side and Formal Concept Analysis and Rough Set Theory from the other. This is done through the formal equivalence among Boolean information tables, formal contexts and hypergraphs. Links with generic (i.e., not Boolean) information tables are established, through so-called nominal scaling. The particular case of...
متن کاملCATEGORY OF (POM)L-FUZZY GRAPHS AND HYPERGRAPHS
In this note by considering a complete lattice L, we define thenotion of an L-Fuzzy hyperrelation on a given non-empty set X. Then wedefine the concepts of (POM)L-Fuzzy graph, hypergraph and subhypergroupand obtain some related results. In particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (POM)L-Fuzzy subhypergroups ...
متن کامل